satisfaction n. 1.滿足,滿意,舒服 (at; with)。 2.〔a satisfaction〕 使(欲望等)滿足的事物。 3.償還,賠償,義務(wù)的履行 (for)。 4.賠償物。 5.【宗教】苦行贖罪。 6.(雪恥,挽回名譽(yù)損失的)決斗;報(bào)復(fù)。 I heard the news with great [much] satisfaction. 我聽了這個(gè)消息非常滿意。 It will be a great satisfaction to you to know that .... 你如果聽到…一定很滿意。 demand satisfaction 要求道歉[決斗,賠償]。 enter (up) satisfaction 在法院備案表明已償清應(yīng)付款項(xiàng)。 give satisfaction 使?jié)M足[滿意];賠償;答應(yīng)決斗。 in full and complete satisfaction 照數(shù)還訖,全數(shù)還清。 in satisfaction of 作為…的賠償。 make satisfaction for 賠償,償還 (satisfaction for a debt [crime] 還債,贖[罪])。 to sb.'s satisfaction =to the satisfaction of 使…滿意地,…得使…滿意。
constraint n. 1.強(qiáng)迫,拘束。 2.約束,壓抑,拘泥。 3.強(qiáng)制力。 4.緊張感[狀態(tài)]。 by constraint 勉強(qiáng),強(qiáng)迫。 feel constraint覺得局促不安,感受壓迫。 show constraint顯得局促。 under [in] constraint 被迫,不得不;被束縛著。
Study on university courses arrangement based on constraint satisfaction 基于約束滿足的高校排課問題研究
Efficient sequential pattern mining algorithm based on average value constraint satisfaction pruning strategy 基于均值約束滿足度剪枝策略的高效序列模式挖掘算法
The intelligent fixing test paper is a process of the problem of constraint satisfaction based on a typical relational database 摘要智能組卷是一個(gè)典型的基于關(guān)系數(shù)據(jù)庫多約束滿足的問題求解過程。
As with other engineering design , die design is , by its nature , a constraint satisfaction problem , how to tailor design space in accordance with constraints 冷沖模設(shè)計(jì)同其它工程設(shè)計(jì)一樣,本質(zhì)上是一個(gè)約束滿足問題,其實(shí)質(zhì)就是多個(gè)約束條件裁減設(shè)計(jì)空間。
For this reason , the thesis presents an approach based on constraint satisfaction , symbolic execution and extended finite state machines . it can analyze programs written in a subset of the c programming language 針對上述情況,本文中提出了一種方法,它基于約束滿足問題求解方法和擴(kuò)展有限狀態(tài)機(jī)上的符號執(zhí)行算法,能夠?qū)語言子集描述的程序進(jìn)行分析。
Artificial neural network is a new active member of all intelligent optimization methods . based on previous constraint satisfaction neural networks , this thesis applies a new constraint satisfaction neural network ( csnn ) for job - shop scheduling problems . based on the general model of nerve cell , the csnn declares 3 types of nerve cells as following : ( 1 ) st ( starting time ) cells , ( 2 ) sc ( sequence constraint ) cells and ( 3 ) rc ( resource constraint ) cells 本文對csnn以及jsp問題的討論分為三個(gè)階段:第一階段討論了基本的csnn網(wǎng)絡(luò)在jsp問題中的應(yīng)用;第二階段以前一階段為基礎(chǔ),將3個(gè)啟發(fā)式算法加入到csnn網(wǎng)絡(luò)中,這3個(gè)啟發(fā)式算法可以單獨(dú)使用或混合使用;第三階段給出了廣義作業(yè)車間調(diào)度問題的概念,并討論了基本的以及加入了啟發(fā)式算法的csnn網(wǎng)絡(luò)在廣義作業(yè)車間調(diào)度問題上的應(yīng)用。
I regard qsim as a kind of constraint satisfaction problem ( csp ) , and improve the qualitative simulation algorithm by constraint logic programming ( clp ) . fuzzy qualitative simulation develops conventional qsim on several facets , such as representation of qualitative value , state transition rule and filtering algorithms . it bridges the gap between pure qualitative and quantitative , and improve the efficien 前者是將定性仿真算法看作一類約束滿足問題,用約束邏輯程序加以改進(jìn),不僅為解決定性仿真問題提供了邏輯框架,而且也是一種規(guī)范化的程序描述語言;模糊定性仿真算法則是對純定性仿真算法在知識描述、狀態(tài)轉(zhuǎn)移規(guī)則、過濾算法等方面的改進(jìn),是一類半定量描述方法,有利于在定性仿真領(lǐng)域綜合定量信息,同時(shí)提高算法的效率。
Pretreatment is used to generate alternate activities to achieve the requirements . theproblem after pretreatment is characterized as a constraint satisfaction problem , which is solvedby the local search algorithm based on dynamic priority . the solution means to specifycorrespondingactivitiesforeveryrequirementandtoallocateexecutingtimeandresources . in order to validate the modeling framework presented in this paper , a software system isdesigned to implement the mission planning and scheduling for msrs 預(yù)處理過程自動生成完成任務(wù)需求的候選活動集;預(yù)處理之后的問題被描述為一個(gè)約束滿足問題,通過基于動態(tài)優(yōu)先級的局部鄰域搜索算法完成問題的求解,即為每個(gè)需求指定相應(yīng)的活動,并為這些活動安排執(zhí)行時(shí)間并指派資源。
This paper presents a generalproblem - solving framework for modeling multi - issue multilateral negotiationusing fuzzy constraints . agent negotiation isformulated as a distributed fuzzy constraint satisfaction problem dfcsp . fuzzy constrains are thus used to naturally represent each agent s desiresinvolving imprecision and human conceptualization , particularly when lexicalimprecision and subjective matters are concerned 隨著網(wǎng)際網(wǎng)絡(luò)的快速發(fā)展,信息社會的來臨,人們期望能隨時(shí)隨地相互連系交換訊息以取得所需的信息,造成目前的信息環(huán)境具有開放巨大及異質(zhì)的特性。
To explain how to use the heuristics information of the problem to construct constraint - based solving algorithm , the general constraint satisfaction solving technology was briefly introduced , then the principles and the applicability of constraint propagation algorithm , tree search algorithm and heuristics repair algorithm for job shop scheduling were summarized 摘要為了說明如何利用啟發(fā)式信息構(gòu)造車間調(diào)度的約束滿足求解算法,首先概述了常規(guī)約束滿足求解技術(shù),進(jìn)而介紹了車間調(diào)度問題的約束傳播算法、樹搜索算法和啟發(fā)式修復(fù)算法的構(gòu)造原理及適用性。
百科解釋
In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that satisfies all constraints.